A Corrective Training Algorithm for Adaptive Learning in Bag Generation
نویسندگان
چکیده
expressions. However, this approach is still very intuitive and simple because it only adjusts the word frequencies in run-time, and does not revise the statistical information in the long-term memory. Multiple language model is based on several corpora of different fields. Basically, a small amount of similar text are imported and interpolated with the original texts, when the context domain is presented. The extra cost of this approach is the context determination. The similarity measures among test sentences and the pre-defined context domains may introduce additional errors. The sampling problem in training corpus is one of the major sources of errors in corpus-based applications. This paper proposes a corrective training algorithm to best-fit the run-time context domain in the application of bag generation. It shows which objects to be adjusted and how to adjust their probabilities. The resulting techniques are greatly simplified and the experimental results demonstrate the promising effects of the training algorithm from generic domain to specific domain. In general, these techniques can be easily extended to various language models and corpus-based applications. In this paper, we would not like to touch on the power of language models. We focus on the sampling problem in training corpus. A corrective training algorithm, which can be also regarded as a dynamic adaptive learning algorithm, is proposed for bag generation. It exploits the run-time feedback information to best-fit the run-time environment. That is, when error occurs, the error result will be corrected by users. Through the modification, the system learns and adapts. It learns the differences between the correct result and the error result. These form the useful run-time feedback information. In other words, the system learns from the mistakes it makes. Under this way, we first propose a language model to deal with the sentence generation, i.e., bag generation, problem and a generic corpus is used to extract the corresponding statistics information. Then the training algorithm will try to adapt the generic language model into a specific one according to the useful run-time feedback information. At the same time, the probabilities of the related entries in training table are adjusted. In the following sections we first introduce the bag generation algorithm, then describe the adaptive learning model for bag generation. Before concluding we
منابع مشابه
Optimal Placement and Sizing of DGs and Shunt Capacitor Banks Simultaneously in Distribution Networks using Particle Swarm Optimization Algorithm Based on Adaptive Learning Strategy
Abstract: Optimization of DG and capacitors is a nonlinear objective optimization problem with equal and unequal constraints, and the efficiency of meta-heuristic methods for solving optimization problems has been proven to any degree of complex it. As the population grows and then electricity consumption increases, the need for generation increases, which further reduces voltage, increases los...
متن کاملA Differential Evolution and Spatial Distribution based Local Search for Training Fuzzy Wavelet Neural Network
Abstract Many parameter-tuning algorithms have been proposed for training Fuzzy Wavelet Neural Networks (FWNNs). Absence of appropriate structure, convergence to local optima and low speed in learning algorithms are deficiencies of FWNNs in previous studies. In this paper, a Memetic Algorithm (MA) is introduced to train FWNN for addressing aforementioned learning lacks. Differential Evolution...
متن کاملThe Prediction of Forming Limit Diagram of Low Carbon Steel Sheets Using Adaptive Fuzzy Inference System Identifier
The paper deals with devising the combination of fuzzy inference systems (FIS) and neural networks called the adaptive network fuzzy inference system (ANFIS) to determine the forming limit diagram (FLD). In this paper, FLDs are determined experimentally for two grades of low carbon steel sheets using out-of-plane (dome) formability test. The effect of different parameters such as work hardening...
متن کاملAn adaptive modified firefly algorithm to unit commitment problem for large-scale power systems
Unit commitment (UC) problem tries to schedule output power of generation units to meet the system demand for the next several hours at minimum cost. UC adds a time dimension to the economic dispatch problem with the additional choice of turning generators to be on or off. In this paper, in order to improve both the exploitation and exploration abilities of the firefly algorithm (FA), a new mo...
متن کاملOptimal Location and Sizing of Distributed Generations in Distribution Networks Considering Load Growth using Modified Multi-objective Teaching Learning Based Optimization Algorithm
Abstract: This paper presents a modified method based on teaching learning based optimization algorithm to solve the problem of the single- and multi-objective optimal location of distributed generation units to cope up the load growth in the distribution network .Minimizing losses, voltage deviation, energy cost and improved voltage stability are the objective functions in this problem. Load g...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/cmp-lg/9407005 شماره
صفحات -
تاریخ انتشار 1994